Paul Catlin 1948-1995
نویسندگان
چکیده
On April 20, 1995, Paul Allen Catlin passed away in Detroit, Michigan, at the age of 46, and the community of Graph Theory lost one of its best friends. Paul Catlin was born on June 25, 1948 in Bridgeport, Connecticut. His life-long love for mathematics was visible from the start. His younger brother, David Catlin, remembers Paul riding around on his tricycle counting for the sheer pleasure of knowing and using numbers [DC]. Paul’s fourth grade teacher, Mrs. Frew, recognized his talent and helped him learn trigonometry that year [JC]. At the age of 14, Paul designed an adding machine and built it from relays; only later did he learn that computers actually work on the principles he incorporated into his machine [JC,DC]. Paul attended the Grand Valley (Michigan) Summer Institute of Mathematics when he was 16. The next year he went to Arnold Ross’s NSF summer institute in number theory at the Ohio State University. This experience not only led directly to the contents of six of his rst seven papers, but also interested him enough in Ohio State that he returned there many years later for graduate work. But even before returning to Ohio State, while still an undergraduate student at Carnegie-Mellon University, he wrote his rst research paper (number [C1] in the publications list) and began his other number theory papers. Paul received his BA at Carnegie-Mellon University in 1970, and then returned to the Ohio State University, where he earned his MS in 1973 and Ph.D. in 1976. In about 1970 he rst became interested in Graph Theory, but that interest did not prevent his working on his number theory problems during his rst years at Ohio State. Indeed, Dijen Ray-Chaudhuri recalls him working late nights during his rst year there, doing his research [DR]. This work resulted in the papers numbered [C2–C4,C6,C7] in his publications list. However, Paul’s time was not spent only on study and research. He was rightly proud of his ability as a pool player. He was a reasonably good shot, and by using English on the cue ball, he could usually complete each shot with the cue ball in the location he wanted for his next shot. Once he kept a record of successive shots
منابع مشابه
Vertex arboricity and maximum degree
The vertex arboricity of graph G is the minimum number of colors that can be used to color the vertices of G so that each color class induces an acyclic subgraph of G. We prove results such as this: if a connected graph G is neither a cycle nor a clique, then there is a coloring of V(G/ with at most [-A(G)/2 ~ colors, such that each color class induces a forest and one of those induced forests ...
متن کاملGraph family operations
In previous papers, Catlin introduced four functions, denoted S, S, S , and S , between sets of nite graphs. These functions proved to be very useful in establishing properties of several classes of graphs, including supereulerian graphs and graphs with nowhere zero kows for a xed integer k¿ 3. Unfortunately, a subtle error caused several theorems previously published in Catlin (Discrete Math. ...
متن کاملGraphs without spanning closed trails
Jaeger [J. Graph Theory 3 (1979) 91-93] proved that if a graph has two edge-disjoint spanning trees, then it is supereulerian, i.e., that it has a spanning closed trail. Catlin [J. Graph Theory 12 (1988) 29-45] showed that if G is one edge short of having two edge-disjoint spanning trees, then G has a cut edge or G is supereulerian. Catlin conjectured that if a connected graph G is at most two ...
متن کاملA Versatile Microrespirometer for Routine Use
A new design of microrespirometer suitable for routine laboratory work has been described.
متن کاملDo vegetation boundaries display smooth or abrupt spatial transitions along environmental gradients? Evidence from the prairieforest biome boundary of historic Minnesota, USA
Danz, N.P. (corresponding author, [email protected]): Department of Natural Sciences, University of Wisconsin-Superior, Belknap and Catlin, Superior, WI 54880, USA Frelich, L.E. ([email protected]) & Reich, P.B. ([email protected]): Department of Forest Resources, University of Minnesota, 115 Green Hall, 1530 Cleveland Ave. N., St. Paul, MN 55108-6112, USA Niemi, G.J. ([email protected]): Departm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 230 شماره
صفحات -
تاریخ انتشار 2001